منابع مشابه
Monotonicity in Graph Searching
We give a new proof of the result, due to A. LaPaugh, that a graph may be optimally " searched " without clearing any edge twice. o 19~~ Academic PWS, IIIC. Let us regard a graph as a system of tunnels containing a (lucky, invisible, fast) fugitive. We desire to capture this fugitive by " searching " all edges of the graph, in a sequence of discrete steps, while using the fewest possible " guar...
متن کاملMonotonicity of Non-deterministic Graph Searching
In graph searching, a team of searchers is aiming at capturing a fugitive moving in a graph. In the initial variant, called invisible graph searching, the searchers do not know the position of the fugitive until they catch it. In another variant, the searchers permanently know the position of the fugitive, i.e. the fugitive is visible. This latter variant is called visible graph searching. A se...
متن کاملDirected Width Measures and Monotonicity of Directed Graph Searching
We consider generalisations of tree width to directed graphs, that attracted much attention in the last fifteen years. About their relative strength with respect to “bounded width in one measure implies bounded width in the other” many problems remain unsolved. Only some results separating directed width measures are known. We give an almost complete picture of this relation. For this, we consi...
متن کاملDigraph Decompositions and Monotonicity in Digraph Searching
We consider monotonicity problems for graph searching games. Variants of these games – defined by the type of moves allowed for the players – have been found to be closely connected to graph decompositions and associated width measures such as pathor tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowin...
متن کاملDirected Searching Digraphs: Monotonicity and Complexity
In this paper, we introduce and study two new search models on digraphs: the directed searching and mixed directed searching. In these two search models, both searchers and intruders must follow the edge directions when they move along edges. We prove the monotonicity of both search models, and we show that both directed and mixed directed search problems are NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1991
ISSN: 0196-6774
DOI: 10.1016/0196-6774(91)90003-h